ELL and EAF1 are Cajal Body Components That Are Disrupted in MLL-ELL Leukemia
نویسندگان
چکیده
منابع مشابه
EAF1, a novel ELL-associated factor that is delocalized by expression of the MLL-ELL fusion protein.
The (11;19)(q23;p13.1) translocation in acute leukemia leads to the generation of a chimeric protein that fuses MLL to the transcriptional elongation factor ELL. A novel protein was isolated from a yeast 2-hybrid screen with ELL that was named EAF1 for ELL-associated factor 1. Using specific antibodies, the endogenous EAF1 and ELL proteins were coimmunoprecipitated from multiple cell lines. In ...
متن کاملELL-associated factor 2 (EAF2), a functional homolog of EAF1 with alternative ELL binding properties.
The (11;19)(q23;p13.1) translocation in acute leukemia results in the formation of an MLL-ELL fusion protein. ELL is an RNA polymerase II elongation factor that interacts with the recently identified EAF1 protein. To characterize the normal functions of ELL and its aberrant activities when fused to MLL, we isolated a second protein that interacts with ELL named EAF2 for ELL Associated Factor 2....
متن کاملMLL-ELL fusion gene in an acute myelomonocytic leukemia patient transformed from acute promyelocytic leukemia
We report an extremely rare case of acute myelomonocytic leukemia (M4) with an MLL-ELL fusion gene lacking the PML-RARα rearrangement that transformed from hypergranular acute promyelocytic leukemia (APL) without showing any karyotypic evolution. The treatment was effective with chemotherapy for M4 and idarubicin plus a cytarabine-based chemotherapy protocol without ATRA.
متن کاملA $2\ell k$ Kernel for $\ell$-Component Order Connectivity
In the `-Component Order Connectivity problem (` ∈ N), we are given a graph G on n vertices, m edges and a non-negative integer k and asks whether there exists a set of vertices S ⊆ V (G) such that |S| ≤ k and the size of the largest connected component in G−S is at most `. In this paper, we give a kernel for `-Component Order Connectivity with at most 2`k vertices that takes nO(`) time for eve...
متن کاملRethinking $(k,\ell)$-anonymity in social graphs: $(k,\ell)$-adjacency anonymity and $(k,\ell)$-(adjacency) anonymous transformations
This paper treats the privacy-preserving publication of social graphs in the presence of active adversaries, that is, adversaries with the ability to introduce sybil nodes in the graph prior to publication and leverage them to create unique fingerprints for a set of victim nodes and re-identify them after publication. Stemming from the notion of (k, l)-anonymity, we introduce (k, l)-anonymous t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Molecular Biology of the Cell
سال: 2003
ISSN: 1059-1524,1939-4586
DOI: 10.1091/mbc.e02-07-0394